Ohta : Uncertainty Models of the Gradient Constraint 959
نویسنده
چکیده
The uncertainty involved in the gradient constraint for optical ow detection is often modeled as constant Gaussian noise added to the time-derivative of the image intensity. In this paper, we examine this modeling closely and investigate the error behavior by doing simulation. Our result indicates that the error depends on both the spatial derivatives and the image motion. We propose alternative uncertainty models based on our experiment. It is shown that the optical ow computation algorithms based on them can detect more accurate optical ow than the conventional least-squares method. key words: optical ow, gradient constraint, noise model, probability model, least squares, maximum likelihood criterion.
منابع مشابه
Optical Flow Detection Using a General Noise Model Naoya OHTA
In the usual optical ow detection, the gradient constraint, which expresses the relationship between the gradient of the image intensity and its motion, is combined with the least-squares criterion. This criterion means assuming that only the time derivative of the image intensity contains noise. In this paper, we assume that all image derivatives contain noise and derive a new optical ow detec...
متن کاملMulti-objective scheduling and assembly line balancing with resource constraint and cost uncertainty: A “box” set robust optimization
Assembly lines are flow-oriented production systems that are of great importance in the industrial production of standard, high-volume products and even more recently, they have become commonplace in producing low-volume custom products. The main goal of designers of these lines is to increase the efficiency of the system and therefore, the assembly line balancing to achieve an optimal system i...
متن کاملEvaluating the Effectiveness of Integrated Benders Decomposition Algorithm and Epsilon Constraint Method for Multi-Objective Facility Location Problem under Demand Uncertainty
One of the most challenging issues in multi-objective problems is finding Pareto optimal points. This paper describes an algorithm based on Benders Decomposition Algorithm (BDA) which tries to find Pareto solutions. For this aim, a multi-objective facility location allocation model is proposed. In this case, an integrated BDA and epsilon constraint method are proposed and it is shown that how P...
متن کاملProfit maximization solid transportation problem under budget constraint using fuzzy measures
Fixed charge solid transportation problems are formulated as profit maximization problems under a budget constraint at each destination. Here item is purchased in different depots at different prices. Accordingly the item is transported to different destinations from different depots using different vehicles. Unitsare sold from different destinations to the customers at different selling prices...
متن کاملA Comprehensive Mathematical Model for Designing an Organ Transplant Supply Chain Network under Uncertainty
One of the most important issues in area of health and hygiene is location-allocation of organ harvesting centers and transplant centers according to coordination between supply and demand. In this paper, a mathematical model is presented for location-allocation of organ harvesting centers and transplant centers. The proposed model does not only minimize the present value of the total system co...
متن کامل